The Universal Generating Function of Analytical Poisson Structures

نویسندگان

  • BENOIT DHERIN
  • B. DHERIN
چکیده

The notion of generating functions of Poisson structures was first studied in [2]. They are special functions which induce, on open subsets of R, a Poisson structure together with the local symplectic groupoid integrating it. A universal generating function was provided in terms of a formal power series coming from Kontsevich star product. The present article proves that this universal generating function converges for analytical Poisson structures and compares the induced local symplectic groupoid with the phase space of Karasev–Maslov. A brief introduction to symplectic groupoids in the perspective of quantization is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)

We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.

متن کامل

Analysis of unreliable bulk queue with statedependent arrivals

In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...

متن کامل

Transient Solution of an M/M/1 Variant Working Vacation Queue with Balking

This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...

متن کامل

Solving a Joint Availability-Redundancy Optimization Model with Multi-State Components with Meta-Heuristic

This paper has been worked on a RAP with multi-state components and the performance rate of each component working state may increase by spending technical and organizational activities costs. Whereas RAP belongs to Np-Hard problems, we used Genetic algorithm (GA) and simulated annealing (SA) and for solving the presented problem and calculating system reliability universal generating function ...

متن کامل

Analytical Depoissonization and its Applications

Wojciech Szpankowskit Department of Computer Science Purdue University W. Lafayette, IN 47907 U.S.A. [email protected] In combinatorics and analysis of algorithms often a Poisson version of a problem (called further Poisson model or poissonization) is easier to solve than the original one, which we name here as the Bernoulli model. Poissonization is a technique that replaces the original input ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005